0 Prolog
↳1 PrologToPrologProblemTransformerProof (⇒, 0 ms)
↳2 Prolog
↳3 PrologToPiTRSProof (⇒, 11 ms)
↳4 PiTRS
↳5 DependencyPairsProof (⇔, 0 ms)
↳6 PiDP
↳7 DependencyGraphProof (⇔, 0 ms)
↳8 PiDP
↳9 PiDPToQDPProof (⇔, 13 ms)
↳10 QDP
↳11 QDPSizeChangeProof (⇔, 0 ms)
↳12 YES
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → U4_G(T5, T6, T7, pA_in_gg(T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → PA_IN_GG(T6, T7)
PA_IN_GG(void, T7) → U1_GG(T7, bin_treeB_in_g(T7))
PA_IN_GG(void, T7) → BIN_TREEB_IN_G(T7)
PA_IN_GG(tree(T14, T15, T16), T7) → U2_GG(T14, T15, T16, T7, bin_treeB_in_g(T15))
PA_IN_GG(tree(T14, T15, T16), T7) → BIN_TREEB_IN_G(T15)
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_GG(T14, T15, T16, T7, pA_in_gg(T16, T7))
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → PA_IN_GG(T16, T7)
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → U4_G(T5, T6, T7, pA_in_gg(T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → PA_IN_GG(T6, T7)
PA_IN_GG(void, T7) → U1_GG(T7, bin_treeB_in_g(T7))
PA_IN_GG(void, T7) → BIN_TREEB_IN_G(T7)
PA_IN_GG(tree(T14, T15, T16), T7) → U2_GG(T14, T15, T16, T7, bin_treeB_in_g(T15))
PA_IN_GG(tree(T14, T15, T16), T7) → BIN_TREEB_IN_G(T15)
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_GG(T14, T15, T16, T7, pA_in_gg(T16, T7))
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → PA_IN_GG(T16, T7)
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → PA_IN_GG(T6, T7)
PA_IN_GG(void, T7) → BIN_TREEB_IN_G(T7)
PA_IN_GG(tree(T14, T15, T16), T7) → U2_GG(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → PA_IN_GG(T16, T7)
PA_IN_GG(tree(T14, T15, T16), T7) → BIN_TREEB_IN_G(T15)
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
BIN_TREEB_IN_G(tree(T5, T6, T7)) → PA_IN_GG(T6, T7)
PA_IN_GG(void, T7) → BIN_TREEB_IN_G(T7)
PA_IN_GG(tree(T14, T15, T16), T7) → U2_GG(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_GG(T14, T15, T16, T7, bin_treeB_out_g(T15)) → PA_IN_GG(T16, T7)
PA_IN_GG(tree(T14, T15, T16), T7) → BIN_TREEB_IN_G(T15)
bin_treeB_in_g(void) → bin_treeB_out_g(void)
bin_treeB_in_g(tree(T5, T6, T7)) → U4_g(T5, T6, T7, pA_in_gg(T6, T7))
pA_in_gg(void, T7) → U1_gg(T7, bin_treeB_in_g(T7))
U1_gg(T7, bin_treeB_out_g(T7)) → pA_out_gg(void, T7)
pA_in_gg(tree(T14, T15, T16), T7) → U2_gg(T14, T15, T16, T7, bin_treeB_in_g(T15))
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → pA_out_gg(tree(T14, T15, T16), T7)
U2_gg(T14, T15, T16, T7, bin_treeB_out_g(T15)) → U3_gg(T14, T15, T16, T7, pA_in_gg(T16, T7))
U3_gg(T14, T15, T16, T7, pA_out_gg(T16, T7)) → pA_out_gg(tree(T14, T15, T16), T7)
U4_g(T5, T6, T7, pA_out_gg(T6, T7)) → bin_treeB_out_g(tree(T5, T6, T7))
bin_treeB_in_g(x0)
pA_in_gg(x0, x1)
U1_gg(x0, x1)
U2_gg(x0, x1, x2, x3, x4)
U3_gg(x0, x1, x2, x3, x4)
U4_g(x0, x1, x2, x3)
From the DPs we obtained the following set of size-change graphs: